package com.ms.p2p;

/**
 * Created by chensk on 2018/4/3.
 */
class Solution {

    public static int[] twoSum(int[] nums, int target) {
        int[] mm = new int[0];
        int lengths = nums.length;
        for(int i=0;i<lengths;i++){
            for(int j=0;j<lengths-(i)-1;i++){
                if(i==j)
                   continue;
                if(nums[j]+nums[i] == target){

                    mm = new int[]{i, j};

                }



            }


        }
        return mm;



    }

}